A new exponential separation between quantum and classical one-way communication complexity
نویسندگان
چکیده
منابع مشابه
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. The problem is a natural generalisation of the previously studied Subgroup Membership problem: Alice receives a bit string x, Bob receives a permutation matrix M , and their task is to determine whether Mx = x or Mx is ...
متن کاملExponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function
We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives an example in the bounded storage model of cryptography, where the key is secure if the adversary...
متن کاملNew bounds on classical and quantum one-way communication complexity
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way model, our bound extends the well known upper bound of Kremer, Nisan and Ron [KNR95] to include non-product distributions. Let ǫ ∈ (0, 1/2) be a constant. We show that for a boolean function f : X ×Y → {0, 1} and a non-pr...
متن کاملUnbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between quantum one-way communication complexity Q(f) and its classical counterpart C(f), under the unbounded-error setting, i.e., it is enough that the success probability is strictly greater than 1/2. It is proved that for any (total or partial) Boolean function f , Q(f) = ⌈C(f)/2⌉, i.e., the former is always exactly one half as large as the latter. The result has a...
متن کاملExponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
We give an exponential separation between one-way quantum and classical communication protocols for a partial Boolean function (a variant of the Boolean Hidden Matching Problem of Bar-Yossef et al.) Earlier such an exponential separation was known only for a relational problem. The communication problem corresponds to a strong extractor that fails against a small amount of quantum information a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2011
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic11.7-8-3